Automatic functions, linear time and learning
نویسندگان
چکیده
منابع مشابه
Automatic Functions, Linear Time and Learning
The present work determines the exact nature of linear time computable notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full learnability for learning in the limit of automatic classes (families of languages which are uniformly recognised by a finite automaton). In particu...
متن کاملLearning Monotonic Linear Functions
Learning probabilities (p-concepts [13]) and other real-valued concepts (regression) is an important role of machine learning. For example, a doctor may need to predict the probability of getting a disease P [y|x], which depends on a number of risk factors. Generalized additive models [9] are a well-studied nonparametric model in the statistics literature, usually with monotonic link functions....
متن کاملThe Automatic Synthesis of Linear Ranking Functions
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking functions are particularly interesting because many terminating loops admit one and algorithms exist to automatically synthesize it. In this paper we present two such algorithms: one based on work dated 1991 by Sohn an...
متن کاملLearning Noisy Linear Threshold Functions
This papers describes and analyzes algorithms for learning linear threshold function (LTFs) in the presence of classiication noise and monotonic noise. When there is classiication noise, each randomly drawn example is mislabeled (i.e., diiers from the target LTF) with the same probability. For monotonic noise, the probability of mis-labeling an example monotonically decreases with the separatio...
متن کاملLinear Functions Preserving Multivariate and Directional Majorization
Let V and W be two real vector spaces and let &sim be a relation on both V and W. A linear function T : V → W is said to be a linear preserver (respectively strong linear preserver) of &sim if Tx &sim Ty whenever x &sim y (respectively Tx &sim Ty if and only if x &sim y). In this paper we characterize all linear functions T : M_{n,m} → M_{n,k} which preserve or strongly preserve multivariate an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(3:19)2013